Regression methods for stochastic control problems
نویسنده
چکیده
In this paper we develop several regression algorithms for solving general stochastic optimal control problems via Monte Carlo. This type of algorithms is particulary useful for problems with high-dimensional state space and complex dependence structure of the underlying Markov process with respect to some control. The main idea of the algorithms is to simulate a set of trajectories under some reference measure P∗ and to use a dynamic program formulation combined with fast methods for approximating conditional expectations and functional optimizations on these trajectories. Theoretical properties of the presented algorithms are investigated and convergence to the optimal solution is proved under mild assumptions. Finally, we present numerical results showing the efficiency of regression algorithms in a case of a highdimensional Bermudan basket options, in a model with a large investor and transaction costs.
منابع مشابه
Regression Methods for Stochastic Control Problems and Their Convergence Analysis
In this paper we develop several regression algorithms for solving general stochastic optimal control problems via Monte Carlo. This type of algorithms is particularly useful for problems with a high-dimensional state space and complex dependence structure of the underlying Markov process with respect to some control. The main idea behind the algorithms is to simulate a set of trajectories unde...
متن کاملMonte Carlo methods via a dual approach for some discrete time stochastic control problems
We consider a class of discrete time stochastic control problems motivated by some financial applications. We use a pathwise stochastic control approach to provide a dual formulation of the problem. This enables us to develop a numerical technique for obtaining an estimate of the value function which improves on purely regression based methods. We demonstrate the competitiveness of the method o...
متن کاملComparison of Modern Stochastic Optimization Algorithms
Gradient-based optimization methods are popular in machine learning applications. In large-scale problems, stochastic methods are preferred due to their good scaling properties. In this project, we compare the performance of four gradient-based methods; gradient descent, stochastic gradient descent, semi-stochastic gradient descent and stochastic average gradient. We consider logistic regressio...
متن کاملDelay-dependent robust stabilization and $H_{infty}$ control for uncertain stochastic T-S fuzzy systems with multiple time delays
In this paper, the problems of robust stabilization and$H_{infty}$ control for uncertain stochastic systems withmultiple time delays represented by the Takagi-Sugeno (T-S) fuzzymodel have been studied. By constructing a new Lyapunov-Krasovskiifunctional (LKF) and using the bounding techniques, sufficientconditions for the delay-dependent robust stabilization and $H_{infty}$ control scheme are p...
متن کاملSolving fuzzy stochastic multi-objective programming problems based on a fuzzy inequality
Probabilistic or stochastic programming is a framework for modeling optimization problems that involve uncertainty.In this paper, we focus on multi-objective linear programmingproblems in which the coefficients of constraints and the righthand side vector are fuzzy random variables. There are several methodsin the literature that convert this problem to a stochastic or<b...
متن کامل